Dynamic Time Slot Partitioning For a Mobile Multihop Relay In Cellular Network

The wireless industry is experiencing a great revolution in order to meet the expectations of the end users. In mobile multi-hop DTSP algorithm, the available bandwidth resources are increased by partitioning each time slot into several minislots wherein different numbers of minislots are allocated to different users. The mobile multi-hop DTSP algorithm is based on asynchronous time-division multiplexing, wherein users with variable number of packets in their buffers can transmit data sequentially without any loss in the overall available resources. In mobile multi-hop, the gateway nodes are in mobility. The base station periodically updates the location information of the gateway nodes. If any of the gateway node gets failed in the network means it gives the information to the base station as well as to their mobile stations. The Base station finds the next gateway node which is nearer to the failed gateway node and moves that node to the failure location in order to transmit and receive the information from the cluster. This will reduce the data transmission distance and the overall communication distance between the mobile station and the base station in the network. The key advantage of DTSP is that it can flexibly adapt to different quality of service requirements. It achieves much higher system capacity through the data transmission distance is reduced. It also achieves the packet delivery ratio performance, end-end delay performance, wider service range, throughput, packet drop, routing overhead and energy consumption in the network on the basis of time and plot the graphs.